[20250212] BOJ / 골드3 / 가희와 탑 / 이강현 #99
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/24337
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
왼쪽에서 가희가 오른쪽에서 단비가 건물을 바라볼때 볼 수 있는 건물의 개수가 주어진다. 이때 가능한 건물 배치중 사전순으로 가장 먼저 오는 건물 배치를 출력
🔍 풀이 방법
구현?
⏳ 회고
직접 여러개를 그려보면서 규칙을 찾았는데 계속 틀렸다고 떠서 반례를 보니 구현때 stringbuilder를 이용하여 이어 붙인 후 떼어냈는데 그러다보니 10 이상은 1 0 이렇게 떼져서 문제가 생겼었다. 리스트를 활용해서 해결했다.